An experimental study of adaptive control for evolutionary algorithms

In this paper, we investigate how adaptive operator selection techniques are able to efficiently manage the balance between exploration and exploitation in an evolutionary algorithm, when solving combinatorial optimization problems. We introduce new high level reactive search strategies based on a generic algorithm's controller that is able to schedule the basic variation operators of the evolutionary algorithm, according to the observed state of the search. Our experiments on SAT instances show that reactive search strategies improve the performance of the solving algorithm.     

Design of delayed reconfigurable manufacturing system based on part family grouping and machine selection

To improve the convertibility of reconfigurable manufacturing system (RMS), the concept of delayed reconfigurable manufacturing system (D-RMS) was proposed. RMS and D-RMS are both constructed around part family. However, D-RMS may suffer from ultra-long system problem with unacceptable idle machines using generic RMS part families. Besides, considering the complex basic system structure of D-RMS, machine selection of D-RMS should be addressed, including dedicated machine, flexible machine, and reconfigurable machine. Therefore, a system design method for D-RMS based on part family grouping and machine selection is proposed. Firstly, a part family grouping method is proposed for D-RMS that groups the parts with more former common operations into the same part family. The concept of longest relative position common operation subsequence (LPCS) is proposed. The similarity coefficient among the parts is calculated based on LPCS. The reciprocal value of the operation position of LPCS is adopted as the characteristic value. The average linkage clustering (ALC) algorithm is used to cluster the parts. Secondly, a machine selection method is proposed to complete the system design of D-RMS, including machine selection rules and the dividing point decision model. Finally, a case study is given to implement and verify the proposed system design method for D-RMS. The results show that the proposed system design method is effective, which can group parts with more former common operations into the same part family and select appropriate machine types.     

基于深度信念网络的列车故障音频诊断方法

铁路在交通运输行业有着举足轻重的地位，一旦列车发生故障将会导致严重的生命财产损失。由于列车发生故障的概率相对较低，因此难以捕获列车的故障样本。针对上述问题，提出了一种无监督学习的列车故障识别方法，通过检测列车音频信号来识别列车故障。该方法基于深度信念网络(DBN)，利用小波包分解提取检测信号的特征向量并将其作为DBN的输入，待网络充分训练后，由训练好的DBN识别当前列车的运行状况。现场监测实验结果表明，该方法能够在无监督的条件下有效识别列车故障，保障了列车的运行安全。     

Sperm metabolism is altered during storage by female insects: evidence from two-photon autofluorescence lifetime measurements in bedbugs

We explore the possibility of characterizing sperm cells without the need to stain them using spectral and fluorescence lifetime analyses after multi-photon excitation in an insect model. The autofluorescence emission spectrum of sperm of the common bedbug, Cimex lectularius, was consistent with the presence of flavins and NAD(P)H. The mean fluorescence lifetimes showed smaller variation in sperm extracted from the male (tau m, τ_m = 1.54–1.84 ns) than in that extracted from the female sperm storage organ (tau m, τ_m = 1.26–2.00 ns). The fluorescence lifetime histograms revealed four peaks. These peaks (0.18, 0.92, 2.50 and 3.80 ns) suggest the presence of NAD(P)H and flavins and show that sperm metabolism can be characterized using fluorescence lifetime imaging. The difference in fluorescence lifetime variation between the sexes is consistent with the notion that female animals alter the metabolism of sperm cells during storage. It is not consistent, however, with the idea that sperm metabolism represents a sexually selected character that provides females with information about the male genotype.     

PTA污水厂COD在线监测结果不合格原因分析及对策

对在线自动监测仪监测结果与人工化验数据存在误差的原因进行分析,以提高在线自动监测仪监测结果的科学性和可靠性,并提出了相对应的建议,有效提升装置出水合格率。     

A Student's t-based density peaks clustering with superpixel segmentation (tDPCSS) method for image color clustering

Image color clustering is a basic technique in image processing and computer vision, which is often applied in image segmentation, color transfer, contrast enhancement, object detection, skin color capture, and so forth. Various clustering algorithms have been employed for image color clustering in recent years. However, most of the algorithms require a large amount of memory or a predetermined number of clusters. In addition, some of the existing algorithms are sensitive to the parameter configurations. In order to tackle the above problems, we propose an image color clustering method named Student's t-based density peaks clustering with superpixel segmentation (tDPCSS), which can automatically obtain clustering results, without requiring a large amount of memory, and is not dependent on the parameters of the algorithm or the number of clusters. In tDPCSS, superpixels are obtained based on automatic and constrained simple non-iterative clustering, to automatically decrease the image data volume. A Student's t kernel function and a cluster center selection method are adopted to eliminate the dependence of the density peak clustering on parameters and the number of clusters, respectively. The experiments undertaken in this study confirmed that the proposed approach outperforms k-means, fuzzy c-means, mean-shift clustering, and density peak clustering with superpixel segmentation in the accuracy of the cluster centers and the validity of the clustering results.     

State-space ARIMA for supply-chain forecasting

ARIMA is seldom used in supply chains in practice. There are several reasons, not the least of which is the small sample size of available data, which restricts the usage of the model. Keeping in mind this restriction, we discuss in this paper a state-space ARIMA model with a single source of error and show how it can be efficiently used in the supply-chain context, especially in cases when only two seasonal cycles of data are available. We propose a new order selection algorithm for the model and compare its performance with the conventional ARIMA on real data. We show that the proposed model performs well in terms of both accuracy and computational time in comparison with other ARIMA implementations, which makes it efficient in the supply-chain context.     

Elitist clonal selection algorithm for optimal choice of free knots in B-spline data fitting

Data fitting with B-splines is a challenging problem in reverse engineering for CAD/CAM, virtual reality, data visualization, and many other fields. It is well-known that the fitting improves greatly if knots are considered as free variables. This leads, however, to a very difficult multimodal and multivariate continuous nonlinear optimization problem, the so-called knot adjustment problem. In this context, the present paper introduces an adapted elitist clonal selection algorithm for automatic knot adjustment of B-spline curves. Given a set of noisy data points, our method determines the number and location of knots automatically in order to obtain an extremely accurate fitting of data. In addition, our method minimizes the number of parameters required for this task. Our approach performs very well and in a fully automatic way even for the cases of underlying functions requiring identical multiple knots, such as functions with discontinuities and cusps. To evaluate its performance, it has been applied to three challenging test functions, and results have been compared with those from other alternative methods based on AIS and genetic algorithms. Our experimental results show that our proposal outperforms previous approaches in terms of accuracy and flexibility. Some other issues such as the parameter tuning, the complexity of the algorithm, and the CPU runtime are also discussed.     

高校实验室计算机网络故障诊断技术研究

为了提升高校实验数据处理水平,高校实验室的相关建设工作已经步入正轨,但层出不穷的信息安全问题也向高校实验室计算机网络维护工作提出了新的挑战。文章从现阶段高校实验室计算机网络的相关建设工作出发,简要论述引发网络故障的具体原因,并对其诊断技术进行探讨。     

GOS+MU:一种查询对象选择新方法

在分析单一MU(Most Uncertainty)采样缺陷的基础上,提出一种"全局最优搜寻"方法 GOS(Global Optimal Search),并结合MU共同完成查询选择。GOS+MU方法中,GOS着眼全局寻找目标,在应用环境能提供的训练样本数量有限、分类器受训不充分时,该方法选择的对象学习价值高,能快速推进分类器学习进程;MU则能够在GOS采样失效情形下,利用分类器当前训练成果,选择查询不确定性最强的样本补充训练集。通过对网络商品的用户评论进行分类仿真,并比较其他采样学习方法的效果,证明了GOS+MU方法在压缩学习成本、提高训练效率方面的有效性。